中英
1
minimum spanning trees中文是什么意思
发音:
- 中文翻译
- 造句
- 第二十三章 最小生成树
- minimum n. (pl. minimums, -ma ) 最小，最 ...
- span span1 〔古语〕 spin 的过去式。
- tree n. 1.树〔主要指乔木，也可指较大的灌木〕。 ★玫瑰可 ...
- minimum cost spanning tree 最小代价生成树
- minimum spanning tree 最小生成树
- minimum(cost)spanning tree 最楔代价）生成树
- mst minimum spanning tree 最小生成树
- spanning 分解; 跨越; 生成的; 斯潘宁; 斯蓬宁
- for the trees 为了树神
- trees 目录树; 时间分辨铕激励光谱学; 树痕; 树木; 树枝状结晶; 树枝状突出物; 特雷斯; 特里斯; 枞叶纹
- boundary spanning 跨越管理
- device spanning 设备跨越; 设备跨展
- disk spanning 硬盘数据跨盘
- linear spanning 线性生成
- spanning airfoil 全跨度翼
- spanning cluster 跨越集团
- spanning equipment 渡河设备
- spanning forest 生成森林
- spanning rail 对接导轨
- spanning receptor 跨膜受体
- spanning set 生成集
- spanning space 生成空间
- spanning subgraph 生成子图
- spanning supergraph 生成母图
- spanning time 对接导轨桥对接时间
- Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法 - Minimum spanning tree
最小代价生成树 - An algorithm for finding minimum spanning trees and comparison with other algorithm
求最小生成树的另一算法及其与其它算法的比较 - Minimum spanning tree
最小生成树 - The application and analyze about the algorithm of minimum spanning tree in multi - join
最小生成树算法在多元连接中的应用及算法分析 - On the models of graph theory based on minimum spanning tree with applications in medicine
基于最小生成树的图论模型及其在医学中的应用 - A new algorithm based on the minimum spanning tree theory of graph was proposed which improved the computation efficiency and reliability of previous methods . 2
对基于图的最小生成树理论的算法进行了改进，新算法在效率和可靠性方面都有所提高； 2 - The algorithm starts with generating a minimum spanning tree to find basic route , and then select , an adjustable unit to modify and determine the final routes
该算法从构造最小生成树开始，找出基本线路；然后通过选择可调单元调整线路得到优化的线路。 - At first , various existing dynamic multicast routing algorithms with no constraint is compared . a dynamic multicast algorithm dpg ( dynamic prim - based greedy multicast algorithm ) which is based on minimum span tree is presented
在比较了典型的动态无约束费用优化多播路由算法后，提出了基于最小生成树的动态贪婪算法? ?一dpg算法。 - For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization , a heuristic search method is proposed , in which based on minimum spanning tree , degrees of vertices over the constrained degrees are reduced to the required state
摘要针对网络设计和优化中度约束最小生成树问题，提出了一种基于贪心思想的启发式算法求解度约束最小生成树。
- 更多例句： 1 2
- 推荐英语阅读
minimum spanning trees的中文翻译，minimum spanning trees是什么意思，怎么用汉语翻译minimum spanning trees，minimum spanning trees的中文意思，minimum spanning trees的中文，minimum spanning trees in Chinese，minimum spanning trees的中文，minimum spanning trees怎么读，发音，例句，用法和解释由查查在线词典提供，版权所有违者必究。
Last modified time:Sun, 17 Aug 2025 00:29:56 GMT
关于我们
